Bisimulations for Temporal Logic Bisimulations for Temporal Logic
نویسنده
چکیده
We define bisimulations for temporal logic with Since and Until. We compare our notion to existing notions of bisimulations, and we use it to develop the basic model theory of temporal logic with Since and Until, which includes preservation and definability' results. We conclude with a brief discussion of the wider applicabilitl' of our ideas.
منابع مشابه
Bisimulations for Temporal Logic
We define bisimulations for temporal logic with Since and Until. This new notion is compared to existing notions of bisimulations, and then used to develop the basic model theory of temporal logic with Since and Until. Our results concern both invariance and definability. We conclude with a brief discussion of the wider applicability of our ideas.
متن کاملModel Checking and Other Games
3 Equivalences, Modal and Temporal Logics 5 3.1 Interactive games and bisimulations . . . . . . . . . . . . . . . 7 3.2 Modal logic and bisimulations . . . . . . . . . . . . . . . . . . . 9 3.3 Temporal properties and modal mu-calculus . . . . . . . . . . 10 3.4 Second-order propositional modal logic . . . . . . . . . . . . . . 15 3.5 Fixed point and second-order games . . . . . . . . . . . . ....
متن کاملBisimulations for intuitionistic temporal logics
We introduce bisimulations for the logic ITL with ◯ (‘next’), U (‘until’) and R (‘release’), an intuitionistic temporal logic based on structures (W,≼, S), where ≼ is used to interpret intuitionistic implication and S is a ≼-monotone function used to interpret the temporal modalities. Our main results are that ◇ (‘eventually’), which is definable in terms of U , cannot be defined in terms of ◯ ...
متن کاملHolger Sturm THE TRUE BISIMULATIONS FOR ‘ SINCE ’ AND ‘ UNTIL ’
The aim of this paper is to establish a new notion of equivalence between temporal models, so-called S-similarity, as the appropriate notion of bisimilarity for temporal logic with Since and Until. The main technical results of the paper provide semantical characterizations of the first-order formulas that are equivalent to a temporal formula: Theorem 3.7 concerns the equivalence of temporal an...
متن کاملUndecidability of Bisimulations in Concurrent Systems with Indeenite Number of Identical Processes
In this paper, we show that bisimulation equivalence between concurrent systems of the type described in 9] is undecidable for two logics | Linear Temporal Logic LT L and LT L without the nexttime operator. Such concurrent systems contain a control process and arbitrarily many identical user processes. These negative results indicate that it might be diicult to compare two such concurrent syste...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996